Permutative universal realizability
نویسندگان
چکیده
منابع مشابه
A universal realizability model for sequential functional computation
We construct a universal and even logically fully abstract realizability model for the sequential functional programming language of call-by-name FPC. This model is defined within the category of modest sets over the total combinatory algebra L of observational equivalence classes of closed terms of the untyped programming language λ+Error. This language is untyped lazy call-by-name lambda-calc...
متن کاملThe Permutative λ-Calculus
We introduce the permutative λ-calculus, an extension of λ-calculus with three equations and one reduction rule for permuting constructors, generalising many calculi in the literature, in particular Regnier’s sigma-equivalence and Moggi’s assoc-equivalence. We prove confluence modulo the equations and preservation of beta-strong normalisation (PSN) by means of an auxiliary substitution calculus...
متن کاملUniversal fermionization of bosons on permutative representations of the Cuntz algebra O 2
Bosons and fermions are described by using canonical generators of Cuntz algebras on any permutative representation. We show a fermionization of bosons which universally holds on any permutative representation of the Cuntz algebra O2. As examples, we show fermionizations on the Fock space and the infinite wedge. Mathematics Subject Classifications (2000). 46K10, 46L60
متن کاملPermutative Additives and Exponentials
Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permutative sequents are structured as oriented surfaces with boundary whose topological complexity is able to encode some information about the exchange in sequential proofs. In this paper we provide a complete permutative sequent ...
متن کاملPermutative rewriting and unification
Permutative rewriting provides a way of analyzing deduction modulo a theory defined by leaf-permutative equations. Our analysis naturally leads to the definition of the class of unify-stable axiom sets, in order to enforce a simple reduction strategy. We then give a uniform unification algorithm modulo theories E axiomatized this way. We prove that it computes complete sets of unifiers of simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Special Matrices
سال: 2021
ISSN: 2300-7451
DOI: 10.1515/spma-2020-0123